منابع مشابه
Transfer Between Analogies: How Solving One Analogy Problem Helps to Solve Another
This paper deals with transfer between analogies; with what people acquire from one analogy problem-solving episode that can be re-applied to a subsequent analogy, problem-solving episode. This issue must be resolved if we are to understand the nature of expertise and the appropriate use of analogy in education. There are two main explanations of what subjects acquire from an analogy problem-so...
متن کاملLanguage Helps Children Succeed on a Classic Analogy Task
Adult humans show exceptional relational ability relative to other species. In this research, we trace the development of this ability in young children. We used a task widely used in comparative research-the relational match-to-sample task, which requires participants to notice and match the identity relation: for example, AA should match BB instead of CD. Despite the simplicity of this relati...
متن کاملColour helps to solve the binocular matching problem.
The spatial differences between the two retinal images, called binocular disparities, can be used to recover the three-dimensional (3D) aspects of a scene. The computation of disparity depends upon the correct identification of corresponding features in the two images. Understanding what image features are used by the brain to solve this binocular matching problem is an important issue in resea...
متن کاملGC-ICP-MS Helps Solve Biogas Usage Problem With Low Detection Limits for Siloxanes
© Agilent Technologies, Inc. February 25 2008 www.agilent.com/chem/icpms to concentrations in biogas, assuming standard sample collection techniques, the resulting detection limits ranged from 0.03 0.07 ppbv (parts per billion by volume), which is 100x lower than the most stringent engine manufacturers requirements and more than 500x more sensitive than the lowest reported GC/MS detection limit.
متن کاملHow a Clebsch-Gordan transform helps to solve the Heisenberg hidden subgroup problem
It has recently been shown that quantum computers can efficiently solve the Heisenberg hidden subgroup problem, a problem whose classical query complexity is exponential. This quantum algorithm was discovered within the framework of using pretty-good measurements for obtaining optimal measurements in the hidden subgroup problem. Here we show how to solve the Heisenberg hidden subgroup problem u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Materials Today
سال: 2006
ISSN: 1369-7021
DOI: 10.1016/s1369-7021(06)71532-2